A nonlinear static approach for curve editing
نویسندگان
چکیده
منابع مشابه
A nonlinear static approach for curve editing
This paper introduces a method for interactively editing planar curves subject to positional and rotational constraints. We regard editing as a static deformation problem but our treatment differs from standard finite element methods in the sense that the interpolation is based on deformation modes rather than the classic shape functions. A careful choice of these modes allows capturing the def...
متن کاملNonlinear Static Procedure for Fragility Curve Development
This study examines the fragility curves of a bridge by two different analytical approaches; one utilizes the time-history analysis and the other uses the capacity spectrum method. The latter approach is one of the simplified nonlinear static procedures recently developed for buildings. In this respect, a sample of 10 nominally identical but statistically different bridges and 80 ground-motion ...
متن کاملa new approach to credibility premium for zero-inflated poisson models for panel data
هدف اصلی از این تحقیق به دست آوردن و مقایسه حق بیمه باورمندی در مدل های شمارشی گزارش نشده برای داده های طولی می باشد. در این تحقیق حق بیمه های پبش گویی بر اساس توابع ضرر مربع خطا و نمایی محاسبه شده و با هم مقایسه می شود. تمایل به گرفتن پاداش و جایزه یکی از دلایل مهم برای گزارش ندادن تصادفات می باشد و افراد برای استفاده از تخفیف اغلب از گزارش تصادفات با هزینه پائین خودداری می کنند، در این تحقیق ...
15 صفحه اولSpace-Time Curve Analogies for Motion Editing
This paper presents a method for analogizing high-dimensional spacetime curves, and shows how it can be used to transform a motion sequence into new content and styles according to two accompanied reference sequences. By providing examples, our system can estimate the parameters of a statistical model which incorporates spatial and temporal factors for motion curves. A user can then easily modi...
متن کاملA dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Graphics
سال: 2012
ISSN: 0097-8493
DOI: 10.1016/j.cag.2012.03.024